Covering posets

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Analogue of Covering Space Theory for Ranked Posets

Suppose P is a partially ordered set that is locally finite, has a least element, and admits a rank function. We call P a weighted-relation poset if all the covering relations of P are assigned a positive integer weight. We develop a theory of covering maps for weighted-relation posets, and in particular show that any weighted-relation poset P has a universal cover P̃ → P , unique up to isomorph...

متن کامل

On-line Adaptive Chain Covering of Upgrowing Posets

We analyze on-line chain partitioning problem and its variants as a two-person game. One person (Spoiler) builds an on-line poset presenting one point at time. The other one (Algorithm) assigns new point to a chain. Kierstead gave a strategy for Algorithm showing that width w posets can be on-line chain partitioned into 5 −1 4 chains. Felsner proved that if Spoiler presents an upgrowing poset, ...

متن کامل

Plane posets, special posets, and permutations

We study the self-dual Hopf algebra HSP of special posets introduced by Malvenuto and Reutenauer and the Hopf algebra morphism from HSP to the Hopf algebra of free quasi-symmetric functions FQSym given by linear extensions. In particular, we construct two Hopf subalgebras both isomorphic to FQSym; the first one is based on plane posets, the second one on heap-ordered forests. An explicit isomor...

متن کامل

Signed Posets

We define a new object, called a signed poset, that bears the same relation to the hyperoctahedral group B n (i.e., signed permutations on n letters), as do posets to the symmetric group S n. We then prove hyperoctahedral analogues of the following results: (1) the generating function results from the theory of P-partitions; (2) the fundamental theorem of finite distributive lattices (or Birkho...

متن کامل

Tchebyshev Posets

We construct for each n an Eulerian partially ordered set Tn of rank n + 1 whose ce-index provides a non-commutative generalization of the n-th Tchebyshev polynomial. We show that the order complex of each Tn is shellable, homeomorphic to a sphere, and that its face numbers minimize the expression max|x|≤1 ∣∣∣∑nj=0(fj−1/fn−1) · 2−j · (x− 1)j∣∣∣ among the f -vectors of all (n − 1)-dimensional si...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1988

ISSN: 0012-365X

DOI: 10.1016/0012-365x(88)90099-4